A New Approach to Solving Linear Fractional Programming Problem with Rough Interval Coefficients in the Objective Function

This paper presents a linear fractional programming problem (LFPP) with rough interval coefficients (RICs) in the objective function. It shows that LFPP RICs function can be converted into (LPP) by using variable transformations. To solve this problem, we will make two LPP (ICs). Next, those four LPPs constructed under these assumptions; solved classical simplex method and used MS Excel Solver. There is also argumentation about solving type of optimization problem. The derived theory applied to several numerical examples its details, but show only for promising.